A Bisection-Like Algorithm for Branch Switching at a Simple Branch Point

نویسندگان

  • J. Hughes
  • Mark J. Friedman
چکیده

At a Simple Branch Point x0 of a parameter-dependent nonlinear system, two distinct solutions branches S1 and S2 intersect. A popular method of branch switching from S1 to S2 at x0 is to use an orthogonal vector to the tangent vector to S1at x0 as an initial guess for the tangent vector to S2 at x0. We describe an improved version of this method using a bisection-like procedure, which is especially useful for large problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simplex Qp-based Methods for Minimizing a Conic Quadratic Objective over Polyhedra

We consider minimizing a conic quadratic objective over a polyhedron. Such problems arise in parametric value-at-risk minimization, portfolio optimization, and robust optimization with ellipsoidal objective uncertainty; and they can be solved by polynomial interior point algorithms for conic quadratic optimization. However, interior point algorithms are not well-suited for branch-and-bound algo...

متن کامل

LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison

While semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection, their practical scope is mostly associated with small dense instances. For large sparse instances, cutting plane techniques are considered the method of choice. These are also applicable for semidefinite relaxations via the spectral bundle method, which allows to...

متن کامل

A Branch-and-Cut to the Point-to-Point Connection Problem on Multicast Networks∗

In multicast routing, one of the basic problems consists of sending data from a set of sources to a set of destinations with minimum cost. A formalization of this problem using graph theory is given by the nonfixed Point-to-Point Connection (PPC) Problem. The optimization version of this problem is known to be NP-hard, and it can be also applied in areas such as circuit switching and VLSI desig...

متن کامل

Comparison of Performance of Traditional Value at Risk Models with Switching Model in Tehran Stock Exchange

The problem of portfolio optimization has made many advances since Markowitz proposed an average-variance-based optimization. It can be said that the most important achievement of the Markowitz model was the introduction of variance as a risk indicator and indeed, the introduction of a quantitative benchmark into it. This research is a model for predicting value at risk. This model extends the ...

متن کامل

Exact Combinatorial Branch-and-Bound for Graph Bisection

We present a novel exact algorithm for the minimum graph bisection problem, whose goal is to partition a graph into two equallysized cells while minimizing the number of edges between them. Our algorithm is based on the branch-and-bound framework and, unlike most previous approaches, it is fully combinatorial. We present stronger lower bounds, improved branching rules, and a new decomposition t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Sci. Comput.

دوره 41  شماره 

صفحات  -

تاریخ انتشار 2009